Dominance-Partitioned Subgraph Matching on Large RDF Graph
نویسندگان
چکیده
منابع مشابه
IRSMG: Accelerating Inexact RDF Subgraph Matching on the GPU
Many approaches have been proposed to solve subgraph matching problem based on filter-and-refine strategy. The efficiency of those existing serial approaches relies on the computational capabilities of CPU. In this paper, we propose an RDF subgraph matching algorithm based on type-isomorphism using GPU since GPU has higher computational performance, more scalability, and lower price than CPU. F...
متن کاملAlgorithms for Graph Similarity and Subgraph Matching
We deal with two independent but related problems, those of graph similarity and subgraph matching, which are both important practical problems useful in several fields of science, engineering and data analysis. For the problem of graph similarity, we develop and test a new framework for solving the problem using belief propagation and related ideas. For the subgraph matching problem, we develo...
متن کاملLarge Scale Graph Representations for Subgraph Census
A Subgraph Census (determining the frequency of smaller subgraphs in a network) is an important computational task at the heart of several graph mining algorithms. Recently, several efficient algorithms have been described. We focus on the g-tries, a data structure that encapsulates the topology of the smaller subgraphs in order to speed up the overall computation. Its algorithm makes extensive...
متن کاملDualIso: Scalable Subgraph Pattern Matching On Large Labeled Graphs SUPPLEMENT
This supplement to the paper provides all figures and substantial code listings which would not fit into the paper due to page limitations. Roadmap: The supplement is organized in the same manner as the main paper i.e. the section names in the main paper corresponds to the same section in the supplement for the easy reference. Note: In many cases, text from the main paper is included and or ext...
متن کاملFast Subgraph Matching on Large Graphs using Graphics Processors
Subgraph matching is the task of finding all matches of a query graph in a large data graph, which is known as an NP-complete problem. Many algorithms are proposed to solve this problem using CPUs. In recent years, Graphics Processing Units (GPUs) have been adopted to accelerate fundamental graph operations such as breadthfirst search and shortest path, owing to their parallelism and high data ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2020
ISSN: 1099-0526,1076-2787
DOI: 10.1155/2020/6620528